翻訳と辞書 Words near each other ・ Mark Zusman ・ Mark Švets ・ Mark's ・ Mark's and Jack's Island Natural Area Preserve ・ Mark's Club ・ Mark's Keyboard Repair ・ Mark's Pizzeria ・ Mark's Stadium ・ Mark, Don & Terry 1966–67 ・ Mark, Illinois ・ Mark, Somerset ・ Mark-8 ・ Mark-Almond ・ Mark-Anthony Kaye ・ Mark-Anthony Turnage ・ Mark-compact algorithm ・ Mark-Jan Fledderus ・ Mark-Lee Kirk ・ Mark-Paul Gosselaar ・ Mark-Peter Hof ・ Mark-to-market accounting ・ Mark-Vlietkanaal ・ Mark-Ye-Well ・ MARK1 ・ MARK2 ・ MARK3 ・ MARK4 ・ Marka ・ Marka (launch site) ・ Marka (river) Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Mark-compact algorithm ： ウィキペディア英語版 Mark-compact algorithm In computer science, a mark-compact algorithm is a type of garbage collection algorithm used to reclaim unreachable memory. Mark-compact algorithms can be regarded as a combination of the mark-sweep algorithm and Cheney's copying algorithm. First, reachable objects are marked, then a compacting step relocates the reachable (marked) objects towards the beginning of the heap area. Compacting garbage collection is used by Microsoft's Common Language Runtime and by the Glasgow Haskell Compiler. ==Algorithms== After marking the live objects in the heap in the same fashion as the mark-sweep algorithm, the heap will often be fragmented. The goal of mark-compact algorithms is to shift the live objects in memory together so the fragmentation is eliminated. The challenge is to correctly update all pointers to the moved objects, most of which will have new memory addresses after the compaction. The issue of handling pointer updates is handled in different ways. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Mark-compact algorithm」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.